On flat extended grids

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimum Flat Grids

This paper presents the results of the analysis of 56,000 flat grids in a form suitable for minimum weight design.

متن کامل

WebGrid II: Developing Hierarchical Knowledge Structures from Flat Grids

The repertory grid has proved a useful tool for knowledge elicitation, yet its ‘flat’ entityattribute-value-value structure seems to preclude its use in developing the hierarchical knowledge structures common in semantic networks. However, it is known that general knowledge representation schemes, such as those of KL-ONE type systems, can be represented as an entity--attribute-value matrix in w...

متن کامل

Spi Computations on Grids Computations on Grids Computations on Grids

We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular automata, relaxing in some way the inherent synchronism of such networks. and asynchronous computations. R esum e Nous etudions comment le graphe sous-jacent de d ependances d'un automate cellulaire de di...

متن کامل

On $GPW$-Flat Acts

In this article, we present $GPW$-flatness property of acts over monoids, which is a generalization of principal weak flatness. We say that a right $S$-act $A_{S}$ is $GPW$-flat if for every $s in S$, there exists a natural number $n = n_ {(s, A_{S})} in mathbb{N}$ such that the functor $A_{S} otimes {}_{S}- $ preserves the embedding of the principal left ideal ${}_{S}(Ss^n)$ into ${}_{S}S$. We...

متن کامل

Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1

Abstract Let G and H be two simple undirected graphs An embedding of the graph G into the graph H is an injective mapping f from the vertices of G to the vertices of H together with a mapping which assigns to each edge u v of G a path between f u and f v in H The grid M r s is the graph whose vertex set is the set of pairs on nonnegative integers f i j i r j sg in which there is an edge between...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(97)00335-x